Some geometric extremal problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremal Problems for Geometric Hypergraphs 1 Extremal Problems for Geometric

A geometric hypergraph H is a collection of i-dimensional simplices, called hyperedges or, simply, edges, induced by some (i + 1)-tuples of a vertex set V in general position in d-space. The topological structure of geometric graphs, i.e., the case d = 2; i = 1, has been studied extensively, and it proved to be instrumental for the solution of a wide range of problems in combinatorial and compu...

متن کامل

Some Extremal Problems in Geometry

Continuing our work of [3] we obtain lower bounds on the number of simplices of different volumes and on the number of hyperplanes determined by n points in Ek , not all of which lie on an Ek-1 and no k of which lie on an Ek-2 . We also determine the minimum number of triangles t determined by n noncollinear points in the plane and discuss what values of t can be achieved . L . M . Kelly and 14...

متن کامل

Some Hilbert Space Extremal Problems

is achieved. This is given by e¡ = (1 -\-'Kkj)~1hj, where X is the unique positive root of £"-0 kj(l +\k])-1\hj\2 = M2. Davis proved the result by first considering the extremal problem for ra dimensional Euclidean space Rn. In this case the problem has the following geometric interpretation : (a") Let E be the hyperellipse {(oi, • • • , an): ]£?„„ kjOJ^M2} in Rn and suppose that h = (hi, • ■ ■...

متن کامل

Some Geometric Clustering Problems

This paper investigates the computational complexity of several clustering problems with special objective functions for point sets in the Euclidean plane. Our strongest negative result is that clustering a set of 3k points in the plane into k triangles with minimum total circumference is NP-hard. On the other hand, we identify several special cases that are solvable in polynomial time due to t...

متن کامل

Some Extremal Problems for Vector Bundles

Analogs of well-known problems and theorems on convex bodies are considered for the case where the convex bodies are replaced by continuous fields of convex bodies in vector bundles.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 1966

ISSN: 0004-9735

DOI: 10.1017/s1446788700004067